Effects of a Hash-based Scheduler on Cache Performance in a Parallel Forwarding System
نویسندگان
چکیده
We investigate the confrontation of load splitting and caching in high-performance parallel network forwarding systems. Our study demonstrates that hashbased load splitting schemes tend to significantly improve the temporal locality of the address stream submitted to a single routing engine (RE), which in turn greatly facilitates caching as a means of increasing system performance. We also show that the impact of locality on the efficiency of load balancing cannot be ignored: load balancing in a parallel forwarding system cannot be studied in isolation from the caching issues.
منابع مشابه
An Adaptive Load Balancer for Multiprocessor Routers
By investigating flow level characteristics of Internet traffic, we are able to trace the root of load imbalance in hash-based load-splitting schemes. We model flow popularity distributions as Zipf-like and prove that under typical Internet traffic mix, a hash scheme cannot balance workload statistically, not even in the long run. We then develop a novel load-balancing packet scheduler for para...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملPACA: A Cooperative File System Cache for Parallel Machines
A new cooperative caching mechanism, PACA, along with a caching algorithm, LRU-Interleaved, and an aggressive prefetching algorithm , Full-File-On-Open, are presented. The caching algorithm is especially targeted to parallel machines running a microkernel-based operating system. It avoids the cache coherence problem with no loss in performance. Comparing our algorithm with N-Chance Forwarding ,...
متن کاملIntegrating Fine-Grained Message Passing in Cache Coherent Shared Memory Multiprocessors
This paper considers the use of data prefetching and an alternative mechanism, data forwarding, for reducing memory latency caused by interprocessor communication in cache coherent, shared memory multiprocessors. Data prefetching is accomplished by using a multiprocessor software pipelined algorithm. Data forwarding is used to target interprocessor data communication, rather than synchronizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003